Decomposing planar graphs into graphs with degree restrictions
نویسندگان
چکیده
Given a graph G $G$ , decomposition of is partition its edges. A ( d h ) $(d,h)$ -decomposable if edge set can be partitioned into $d$ -degenerate and with maximum degree at most $h$ . For ≤ 4 $d\le 4$ we are interested in the minimum integer ${h}_{d}$ such that every planar $(d,{h}_{d})$ -decomposable. It was known 3 ${h}_{3}\le 2 8 ${h}_{2}\le 8$ 1 = ∞ ${h}_{1}=\infty $ This paper proves ${h}_{4}=1,{h}_{3}=2$ 6 $4\le {h}_{2}\le 6$
منابع مشابه
Decomposing Graphs of High Minimum Degree into 4-Cycles
If a graph G decomposes into edge-disjoint 4-cycles, then each vertex of G has even degree and 4 divides the number of edges in G. It is shown that these obvious necessary conditions are also sufficient when G is any simple graph having minimum degree at least ( 32 + on(1))n, where n is the number of vertices in G. This improves the bound given by Gustavsson (1991), who showed (as part of a mor...
متن کاملDecomposing Graphs into Long Paths
It is known that the edge set of a 2-edge-connected 3-regular graph can be decomposed into paths of length 3. W. Li asked whether the edge set of every 2-edge-connected graph can be decomposed into paths of length at least 3. The graphs C3, C4, C5, and K4 − e have no such decompositions. We construct an infinite sequence {Fi}∞i=0 of nondecomposable graphs. On the other hand, we prove that every...
متن کاملDecomposing complete graphs into cubes
This talk concerns when the complete graph on n vertices can be decomposed into d-dimensional cubes, where d is odd and n is even. (All other cases have been settled.) Necessary conditions are that n ≡ 1 (mod d) and n ≡ 0 (mod 2). These are known to be sufficient for d equal to 3 or 5, but for larger values of d a decomposition has been proven to exist for only sparce sets of n. We prove that f...
متن کاملCovering planar graphs with degree bounded forests
We prove that every planar graphs has an edge partition into three forests, one having maximum degree 4. This answers a conjecture of Balogh et al. (J. Combin. Theory B. 94 (2005) 147-158).We also prove that every planar graphs with girth g ≥ 6 (resp. g ≥ 7) has an edge partition into two forests, one having maximum degree 4 (resp. 2).
متن کاملDecomposing oriented graphs into 6 locally irregular oriented graphs
An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪ ...∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently conjectured by Baudon et al. that every undirected graph admits a decomposition into 3 locally irre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2022
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22817